Growing Grid with False-Neighbor Degree
نویسندگان
چکیده
We apply the self-organization considering falseneighbor degree to the fine-tuning of Growing Grid after the growth process is finished. This study proposes a Growing Grid with False-Neighbor degree (FN-GG). We confirm that FN-GG can self-organize the input data, which is in a rectangular input space, most effectively.
منابع مشابه
Self-Organizing Map with False-Neighbor Degree between Neurons for Effective Self-Organization
In the real world, it is not always true that the nextdoor house is close to my house, in other words, “neighbors” are not always “true neighbors”. In this study, we propose a new Self-Organizing Map (SOM) algorithm, SOM with False Neighbor degree between neurons (called FN-SOM). The behavior of FN-SOM is investigated with learning for various input data. We confirm that FN-SOM can obtain the m...
متن کاملGIS-based analysis of spatial distribution patterns of growing degree-days for agricultural applications in Iran
The geographical distribution of growing degree-days (GDDs) within Iran was studied using GIS-based maps. GDDs were calculated using daily thermal parameters (daily maximum and minimum air temperature). Based on the purpose of the study and climatic conditions of Iran, the average value of 5?C was chosen for GDD calculation. The calculations were carried out using daily weather data of 113 mete...
متن کاملA Localization Approach for Crowdsourced Air Traffic Communication Networks
In this work, we argue that current state-of-theart methods of aircraft localization such as multilateration are insufficient, in particular for modern crowdsourced air traffic networks with random, unplanned deployment geometry. We propose an alternative, a grid-based localization approach using the k-Nearest Neighbor algorithm, to deal with the identified shortcomings. Our proposal does not r...
متن کاملUsing distributed local information to improve global performance in Grids
Grid computing refers to the federation of geographically distributed and heterogeneous computer resources. These resources may belong to different administrative domains, but are shared among users. Every grid presents a key component responsible for obtaining, distributing, indexing and archiving information about the configuration and state of services and resources. Optimizing tasks assigna...
متن کاملIndexing of the Discrete Global Grid Using Linear Quadtree
In recent years a method of recursive subdivisions of the triangular faces of the octahedron or icosahedron has been developed for approximating to the surface of the earth. But the triangle-based discrete grids produced by this method are complicated in geometry structure, and is difficult to make such geographical operations as neighbor-finding, spatial searches and so on. In this paper we co...
متن کامل